Optimal assignment of principalship in teams

نویسندگان

  • Shuhe Li
  • Weiying Zhang
چکیده

This paper investigates the optimal assignment of principalship in teams. We formalize a theory of the firm pioneered by Alchian and Demsetz [Am. Econ. Rev. 62 (1972) 777] using an approach in the spirit of Grossman and Hart [J. Pol. Econ. 94 (1986) 691]. Our theory makes a distinction between production effort and monitoring effort. When it is costly to sign contracts on efforts, it may be optimal to let one party purchase the rights to monitor and to direct, and claim full residual. Principalship is the purchase of these rights. These rights are limited residual rights of control over actions. We have confirmed Alchian and Demsetz’s celeberated conjecture that residual claims should match residual control. We have also explored how the optimal assignment of principalship and partnership depends on the interaction between each member’s importance in production, the effectiveness of monitoring and the degree of teamwork. © 2001 Elsevier Science B.V. All rights reserved. JEL classification: D2; D8; L2

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Different Network Performance Measures in a Multi-Objective Traffic Assignment Problem

Traffic assignment algorithms are used to determine possible use of paths between origin-destination pairs and predict traffic flow in network links. One of the main deficiencies of ordinary traffic assignment methods is that in most of them one measure (mostly travel time) is usually included in objective function and other effective performance measures in traffic assignment are not considere...

متن کامل

Using Genetic Algorithms for Large Scale Optimizationof Assignment, Planning and Rescheduling Problems

There has always been a need to solve real-life large-scale problems, such as efficiently allocating limited resources, and other complex and conflicting situations related to combinatorial optimization genre. A class of combinatorial optimization problems is NP-hard and, among many well-known, several of them are assignment, planning and rescheduling problems. Assignment problems can deal with...

متن کامل

Dependent Randomized Rounding to the Home-Away Assignment Problem in Sports Scheduling

Suppose that we have a timetable of a round-robin tournament with a number of teams, and distances among their homes. The home-away assignment problem is to find a home-away assignment that minimizes the total traveling distance of the teams. We propose a formulation of the home-away assignment problem as an integer program, and a rounding algorithm based on Bertsimas, Teo and Vohra’s dependent...

متن کامل

Optimal Target Assignment and Path Finding for Teams of Agents

We study the TAPF (combined target-assignment and pathfinding) problem for teams of agents in known terrain, which generalizes both the anonymous and non-anonymous multiagent path-finding problems. Each of the teams is given the same number of targets as there are agents in the team. Each agent has to move to exactly one target given to its team such that all targets are visited. The TAPF probl...

متن کامل

Calculating of the optimal number and location of blood supply centers in the case of East Azerbaijan

Background and Objectives: One of the key issues in determining location for blood supply center is the design of blood supply chain. To minimize the cost of blood supply, the donors should be reached easily with appropriate distribution of blood and blood products to the hospital. The aim of this study was calculating of the optimal number and location of different various t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000